Recognizing Union-Find trees is NP-complete
نویسندگان
چکیده
Disjoint-Set forests, consisting of Union-Find trees are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a characterization exists for Union trees which are constructed without using path compression). In this paper we provide such a characterization and show that the decision problem whether a given tree is a Union-Find tree is NP-complete.
منابع مشابه
Recognizing Union-Find Trees Built Up Using Union-By-Rank Strategy is NP-Complete
Disjoint-Set forests, consisting of Union-Find trees, are data structures having a widespread practical application due to their efficiency. Despite them being well-known, no exact structural characterization of these trees is known (such a characterization exists for Union trees which are constructed without using path compression) for the case assuming union-by-rank strategy for merging. In t...
متن کاملPartitionability to two trees is NP-complete
We show that P2T-the problem of deciding whether the edge set of a simple graph can be partitioned into two trees or not-is NP-complete. It is a well known that deciding whether the edge set of a graph can be partitioned into k spanning trees or not is in P [1]. Recently András Frank asked what we know about partitioning the edge set of a graph into k (not necessarily spanning) trees. One can e...
متن کاملComplexity Bounds for Muller Games
We consider the complexity of infinite games played on finite graphs. We establish a framework in which the expressiveness and succinctness of different types of winning conditions can be compared. We show that the problem of deciding the winner in Muller games is Pspace-complete. This is then used to establish Pspacecompleteness for Emerson-Lei games and for games described by Zielonka DAGs. A...
متن کاملRecognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete
A graph is unfrozen with respect to k independent set if it has an independent set of size k after the addition of any edge. The problem of recognizing such graphs is known to be NP-complete. A graph is maximal if the addition of one edge means it is no longer unfrozen. We designate the problem of recognizing maximal unfrozen graphs as MAX(U(k-SET)) and show that this problem is CO-NP-complete....
متن کاملRecognizing Pseudo-intents is coNP-complete
The problem of recognizing whether a subset of attributes is a pseudo-intent is shown to be coNP-hard, which together with the previous results means that this problem is coNP-complete. Recognizing an essential intent is shown to be NP-complete and recognizing the lectically largest pseudo-intent is shown to be coNP-hard.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 131 شماره
صفحات -
تاریخ انتشار 2018